A theory of interval iteration

On Singular Interval-Valued Iteration Groups

Let I = (a,b) and L be a nowhere dense perfect set containing the ends of the interval I and let φ : I → R be a non-increasing continuous surjection constant on the components of I \ L and the closures of these components be the maximal intervals of constancy of . The family F t t R of the interval-valued functions F t 1 φ { , ∈ } (x): = φ [t + φ(x)], x ∈ I forms a set-valued iteration group. W...

Sensitivity Analysis Using a Fixed Point Interval Iteration

Proving the existence of a solution to a system of real equations is a central issue in numerical analysis. In many situations, the system of equations depend on parameters which are not exactly known. It is then natural to aim proving the existence of a solution for all values of these parameters in some given domains. This is the aim of the parametrization of existence tests. A new parametric...

applying transitivity theory to gender analysis of efl textbook: : a comparative study.

efl/esl textbooks have been regarded as essential language teaching materials with which the learners spend about 70 up to 90 percent of their class time. the important role they play and their vast use make them not only influential in learning the language but also in shaping values and attitudes. put it another way, textbooks socialize learners using their contents (i.e. texts, illustrations...

Iteration Theory and Inequalities for Kleinian Groups

Reasoning about Iteration in Gödel's Class Theory

A computer implementation of Gödel’s algorithm for class formation in Mathematica was used to formulate definitions and theorems about iteration in Gödel’s class theory. The intent is to use this approach for automated reasoning about a variety of applications of iteration using McCune’s automated reasoning program Otter. The applications include the theory of transitive closures of relations, ...